An outer approximation bi-level framework for mixed categorical structural optimization problems
نویسندگان
چکیده
In this paper, mixed categorical structural optimization problems are investigated. The aim is to minimize the weight of a truss structure with respect cross-section areas, materials, and type. proposed methodology consists using bi-level decomposition involving two problems: master slave. problem formulated as mixed-integer linear where constraints incrementally augmented outer approximations slave solution. addresses continuous variables problem. tested on three different test cases increasing complexity. comparison state-of-the-art algorithms emphasizes efficiency in terms optimum quality, computation cost, well its scalability dimension. A challenging 120-bar dome 90 choices per bar also tested. obtained results showed that our method able solve efficiently large-scale problems.
منابع مشابه
A Two Level Approximation Technique for Structural Optimization
This work presents a method for optimum design of structures, where the design variables can he considered as Continuous or discrete. The variables are chosen as sizing variables as well as coordinates of joints. The main idea is to reduce the number of structural analyses and the overal cost of optimization. In each design cycle, first the structural response quantities such as forces, displac...
متن کاملBi-level clustering of mixed categorical and numerical biomedical data
Biomedical data sets often have mixed categorical and numerical types, where the former represent semantic information on the objects and the latter represent experimental results. We present the BILCOM algorithm for 'Bi-Level Clustering of Mixed categorical and numerical data types'. BILCOM performs a pseudo-Bayesian process, where the prior is categorical clustering. BILCOM partitions biomedi...
متن کاملAn Optimization Approach to Bi-level Quadratic Programming Problems
ABSTRACT. Bi-level programming problems are an important type of multi-variable and double-layer programming problems. These problems appear everywhere especially in the industrial, supply-chain, and marketing programming applications. In this work, two new original approaches are proposed to solve bi-level quadratic programming problems in different cases: the so-called ergodic branch-and-boun...
متن کاملA Bi-clustering Framework for Categorical Data
Bi-clustering is a promising conceptual clustering approach. Within categorical data, it provides a collection of (possibly overlapping) bi-clusters, i.e., linked clusters for both objects and attribute-value pairs. We propose a generic framework for bi-clustering which enables to compute a bi-partition from collections of local patterns which capture locally strong associations between objects...
متن کاملUsing Interior-point Methods within an Outer Approximation Framework for Mixed Integer Nonlinear Programming
Interior-point methods for nonlinear programming have been demonstrated to be quite efficient, especially for large scale problems, and, as such, they are ideal candidates for solving the nonlinear subproblems that arise in the solution of mixed-integer nonlinear programming problems via outer approximation. However, traditionally, infeasible primal-dual interior-point methods have had two main...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Structural and Multidisciplinary Optimization
سال: 2022
ISSN: ['1615-1488', '1615-147X']
DOI: https://doi.org/10.1007/s00158-022-03332-8